Outlining a graphical model query approach based on graph matching

نویسندگان

  • Dominic Breuker
  • Hanns-Alexander Dietrich
  • Matthias Steinhorst
  • Patrick Delfmann
چکیده

This paper outlines a graphical model query approach based on graph matching. It consists of a graphical query specification language and a matching algorithm based on graph matching that takes the query as input and returns all matches found in a model to be searched. The graphical query specification language can be used to draw model queries much like a model would be constructed. To achieve applicability in many different model analysis scenarios, the query approach provides structurally exact and structurally similar pattern matching as well as semantic comparison of model node and edge contents. Following a design science research process, we derive functional requirements for the query language and matching algorithm from the literature, outline its syntax, formally specify its matching principle, and demonstrate its functionality by providing a working prototype implementing previously identified requirements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Assessing Multivariate Balance Conditional on the Propensity Score using Undirected Graphical Models

This note proposes a novel approach for assessing the balancing hypothesis that underlies propensity score matching methods based on using an information-theoretic approach to fit undirected graphical models. Graphical models are parametric statistical models for multivariate random variables whose conditional independence structure can be displayed in a mathematical graph. Specialized software...

متن کامل

Answering Table Queries on the Web using Column Keywords

We present the design of a structured search engine which returns a multi-column table in response to a query consisting of keywords describing each of its columns. We answer such queries by exploiting the millions of tables on the Web because these are much richer sources of structured knowledge than free-format text. However, a corpus of tables harvested from arbitrary HTML web pages presents...

متن کامل

مدل جدیدی برای جستجوی عبارت بر اساس کمینه جابه‌جایی وزن‌دار

Finding high-quality web pages is one of the most important tasks of search engines. The relevance between the documents found and the query searched depends on the user observation and increases the complexity of ranking algorithms. The other issue is that users often explore just the first 10 to 20 results while millions of pages related to a query may exist. So search engines have to use sui...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

VMQL: A visual language for ad-hoc model querying

In large scale model based development, analysis level models are more like knowledge bases than engineering artifacts. Their effectiveness depends, to a large degree, on the ability of domain experts to retrieve information from them ad hoc. For large scale models, however, existing query facilities are inadequate. The Visual Model Query Language (VMQL) is a novel approach that uses the respec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014